Feedback, trace and fixed-point semantics

نویسندگان

  • Piergiulio Katis
  • Nicoletta Sabadini
  • Robert F. C. Walters
چکیده

We introduce a notion of category with feedback-withdelay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain a categorical analogue of the classical localization of a ring with respect to a multiplicative subset. In this context we define a notion of fixedpoint semantics of a category with feedback which is seen to include a variety of classical semantics in computer science. Mathematics Subject Classification. 68Q55, 68Q70, 18D10.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Coalgebras with Internal Moves

In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by study...

متن کامل

$C$-class and $F(psi,varphi)$-contractions on $M$-metric spaces

Partial metric spaces were introduced by Matthews in 1994 as a part of the study of denotational semantics of data flow networks. In 2014 Asadi and {it et al.} [New Extension of $p$-Metric Spaces with Some fixed point Results on $M$-metric paces, J. Ineq. Appl. 2014 (2014): 18] extend the Partial metric spaces to $M$-metric spaces. In this work, we introduce the class of $F(psi,varphi)$-contrac...

متن کامل

Modal Design Algebra

We give an algebraic model of (H3) designs based on a variant of modal semirings, hence generalising the original relational model. This makes the theory applicable to a wider class of settings, e.g., to algebras of sets of traces. Moreover, we set up the connection with the weakly and strongly demonic semantics of programs as discussed by a number of authors. This is done using commands (a, t)...

متن کامل

Soundness of Data Flow Analyses for Weak Memory Models

Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and originally posed by Rinard: we identify sufficient conditions for a data flow analysis to be sound w.r.t. weak memory models. We first identify a class of analyses that are sound, and provide a formal proof of soundne...

متن کامل

Acceptances, Behaviours and Infinite Activity in CSPP

The denotational semantics presented here defines an extension of CSP called CSPP . It includes a full description of infinite behaviour in one simple model using only finite traces. This is true for both finite and infinite alphabets. The structure is a complete lattice, and so also a complete partial order, under refinement. Thus recursion is defined by fixed points in the usual way. It is al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ITA

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2002